A Monte-Carlo Algorithm for Dempster-Shafer Belief
نویسنده
چکیده
A very computationally-efficient MonteCarlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster’s Rule of belief functions Bel1, . . . ,Belm then, for subset b of the frame Θ, Bel(b) can be calculated in time linear in |Θ| and m (given that the weight of conflict is bounded). The algorithm can also be used to improve the complexity of the Shenoy-Shafer algorithms on Markov trees, and be generalised to calculate Dempster-Shafer Belief over other logics.
منابع مشابه
Markov Chain Monte-Carlo Algorithms for the Calculation of Dempster-Shafer Belief
A simple Monte-Carlo algorithm can be used to calculate Dempster-Shafer belief very efficiently unless the conflict between the evidences is very high. This paper introduces and explores Markov Chain Monte-Carlo algorithms for calculating Dempster-Shafer belief that can also work well when the conflict is high.
متن کاملZero-Sum Matrix Game with Payoffs of Dempster-Shafer Belief Structures and Its Applications on Sensors
The zero-sum matrix game is one of the most classic game models, and it is widely used in many scientific and engineering fields. In the real world, due to the complexity of the decision-making environment, sometimes the payoffs received by players may be inexact or uncertain, which requires that the model of matrix games has the ability to represent and deal with imprecise payoffs. To meet suc...
متن کاملAlgorithms for Dempster-Shafer Theory
The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 67; 68] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 76], and further publications e.g., [Shafer, 81; 90]. More recent variants of Dempster-Shafer theory include the Transferable Belief Model see e.g., ...
متن کاملRules, Belief Functions and Default Logic
This paper describes a natural framework for rules , based on belief functions , which includes a repre s entation of numerical rules, default rules and rules allowing and rules not allowing contraposition. In particular it justifies the use of th e Dempster-Shafer Th eory for representing a particular class of rules , Belief calculated being a lower probability given cer tain independence as...
متن کاملBounds on Belief and Plausibility of Functionally Propagated Random Sets
We are interested in improving risk and reliability analysis of complex systems where our knowledge of system performance is provided by large simulation codes, and where moreover input parameters are known only imprecisely. Such imprecision lends itself to interval representations of parameter values, and thence to quantifying our uncertinay through Dempster-Shafer or Probability Bounds repres...
متن کامل